On String Matching in Chunked Texts
نویسندگان
چکیده
منابع مشابه
Multi-level NER for Portuguese in a CG Framework
This paper describes and evaluates a linguistically based NER system for Portuguese, based on lexico-semantical information, pattern matching and morphosyntactic, context driven Constraint Grammar rules. Preliminary Fscores for cross-domain news texts, when distinguishing six different name types, were 91.85 (raw) and 93.6 (subtyping of ready-chunked proper nouns).
متن کاملProcessing Text Files as Is: Pattern Matching over Compressed Texts, Multi-byte Character Texts, and Semi-structured Texts
Techniques in processing text files “as is” are presented, in which given text files are processed without modification. The compressed pattern matching problem, first defined by Amir and Benson (1992), is a good example of the “as-is” principle. Another example is string matching over multi-byte character texts, which is a significant problem common to oriental languages such as Japanese, Kore...
متن کاملResearch Paper: Fast Exact String Pattern-matching Algorithms Adapted to the Characteristics of the Medical Language
OBJECTIVE The authors consider the problem of exact string pattern matching using algorithms that do not require any preprocessing. To choose the most appropriate algorithm, distinctive features of the medical language must be taken into account. The characteristics of medical language are emphasized in this regard, the best algorithm of those reviewed is proposed, and detailed evaluations of t...
متن کاملTowards Faster String Matching
Aalto University, P.O. Box 11000, FI-00076 Aalto www.aalto.fi Author Hannu Peltola Name of the doctoral dissertation Towards Faster String Matching Publisher Aalto University School of Science Unit Department of Computer Science Series Aalto University publication series DOCTORAL DISSERTATIONS 78/2013 Field of research Software Technology Manuscript submitted 11 December 2012 Date of the defenc...
متن کاملA fast implementation of the Boyer–Moore string matching algorithm
String matching is the problem of finding all the occurrences of a pattern in a text. We present a new method to compute a combinatorial shift function (“best matching shift”) of the well-known Boyer–Moore string matching algorithm. Moreover we conduct experiments showing that the algorithm using this best matching shift is the most efficient in particular cases such as the search for patterns ...
متن کامل